Primal Dual Gives Optimal Energy Efficient Online Algorithms
نویسندگان
چکیده
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scaling to minimize the sum of energy and weighted flow time. We give an algorithm with an almost optimal competitive ratio for arbitrary power functions. (No earlier results handled arbitrary power functions for unrelated machines.) For power functions of the form f(s) = s for some constant α > 1, we get a competitive ratio of O( α logα ), improving upon a previous competitive ratio of O(α) [3], along with a matching lower bound of Ω( α logα ). Further, in the resource augmentation model, with a 1+ speed up, we give a 2( 1 +1) competitive algorithm, with essentially the same techniques, matching the bound of [3] for the special case of fixed speed unrelated machines. Unlike the previous results most of which used an amortized local competitiveness argument or dual fitting methods, we use a primal-dual method, which is useful not only to analyze the algorithms but also to design the algorithm itself.
منابع مشابه
Primal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملLagrangian Duality based Algorithms in Online Scheduling
We consider Lagrangian duality based approaches to design and analyze algorithms for online energy-efficient scheduling. First, we present a primal-dual framework. Our approach makes use of the Lagrangian weak duality and convexity to derive dual programs for problems which could be formulated as convex assignment problems. The duals have intuitive structures as the ones in linear programming. ...
متن کاملOnline Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
We give a principled method to design online algorithms (for potentially non-linear problems) using a mathematical programming formulation of the problem, and also to analyze the competitiveness of the resulting algorithm using the dual program. This method can be viewed as an extension of the online primal-dual method for linear programming problems, to nonlinear programs. We show the applicat...
متن کاملPrimal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems
We study a variety of online scheduling problems on a single processor that can be viewed as extensions of the well-studied problem of minimizing total weighted flow time. Most previous work on this class of problems has relied on amortized analysis and the use of complicated potential-function arguments. In this paper we follow a different approach based on the primal-dual and dual-fitting par...
متن کاملThe Design of Competitive Online Algorithms via a Primal-Dual Approach
The primal–dual method is a powerful algorithmic technique that has proved to be extremely useful for a wide variety of problems in the area of approximation algorithms for NP-hard problems. The method has its origins in the realm of exact algorithms, e.g., for matching and network flow. In the area of approximation algorithms, the primal–dual method has emerged as an important unifying design ...
متن کامل